First order compiler: A deterministic logic program synthesis algorithm
نویسندگان
چکیده
منابع مشابه
Seduct - A Proof Compiler for First Order Logic
In this paper we present Seduct, which is a theorem prover for many–sorted first order logic. Seduct has been specially tailored to economically discharge proof obligations arising during the process of software verification. We will mainly describe those features of Seduct which distinguish this theorem prover from other theorem provers and which make it especially suited for software verifica...
متن کاملFirst-Order Logic Characterization of Program Properties
A program is rst-order reducible (FO-reducible) with respect to (wrt) a set of integrity constraints if there exists a rst-order theory T such that the set of models for T is exactly the set of intended models for the program wrt all possible EDB's. In this case, we say that P is FO-reducible to T wrt IC. For FO-reducible programs, it is possible to characterize, using rst-order logic implicati...
متن کاملAutomatic Program Synthesis in Second-Order Logic
Abetract A resolution-based theorem prover, incorporating a restricted higher-order unification algorithm , has been applied to the automatic synthesis of SN0B0L-4 programs. The set of premisses includes second-order assignment and iteration axioms derived from those of Hoare. Two examples are given of the synthesis of programs that compute elementary functions. Descriptive Terms Higher-order l...
متن کاملLogic Program Synthesis in a Higher-Order Setting
We describe a system for the synthesis of logic programs from specifications based on higher-order logical descriptions of appropriate refinement operations. The system has been implemented within the proof planning system λClam . The generality of the approach is such that its extension to allow synthesis of higher-order logic programs was straightforward. Some illustrative examples are given....
متن کاملLearning First Order Logic Rules with a Genetic Algorithm
This paper introduces a new algorithm called SIAO1 for learning first order logic rules with genetic algorithms. SIAO1 uses the covering principle developed in AQ where seed examples are generalized into rules using however a genetic search, as initially introduced in the SIA algorithm for attribute-based representation. The genetic algorithm uses a high level representation for learning rules ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1989
ISSN: 0747-7171
DOI: 10.1016/s0747-7171(89)80064-1